Sequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics

نویسندگان

  • George Metcalfe
  • Nicola Olivetti
  • Dov M. Gabbay
چکیده

We present two embeddings of in nite-valued Lukasiewicz logic L into Meyer and Slaney’s abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for L. These include: hypersequent calculi for A and L and terminating versions of these calculi; labelled single sequent calculi for A and L of complexity co-NP; unlabelled single sequent calculi for A and L.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Labelled Tree Sequents, Tree Hypersequents and Nested (Deep) Sequents

We identify a subclass of labelled sequents called “labelled tree sequents” and show that these are notational variants of tree-hypersequents in the sense that a sequent of one type can be represented naturally as a sequent of the other type. This relationship can be extended to nested (deep) sequents using the relationship between tree-hypersequents and nested (deep) sequents, which we also sh...

متن کامل

Intermediate logics admitting a structural hypersequent calculus

We characterise the intermediate logics which admit a cut-free hypersequent calculus of the form HLJ+ R, where HLJ is the hypersequent counterpart of the sequent calculus LJ for propositional intuitionistic logic, and R is a set of so-called structural hypersequent rules, i.e., rules not involving any logical connectives. The characterisation of this class of intermediate logics is presented bo...

متن کامل

Hypersequent Calculi for Gödel Logics - a Survey

Hypersequent calculi arise by generalizing standard sequent calculi to refer to whole contexts of sequents instead of single sequents. We present a number of results using hypersequents to obtain a Gentzen-style characterization for the family of Gödel logics. We first describe analytic calculi for propositional finite and infinite-valued Gödel logics. We then show that the framework of hyperse...

متن کامل

Bunched Hypersequent Calculi for Distributive Substructural Logics

We introduce a new proof-theoretic framework which enhances the expressive power of bunched sequents by extending them with a hypersequent structure. A general cut-elimination theorem that applies to bunched hypersequent calculi satisfying general rule conditions is then proved. We adapt the methods of transforming axioms into rules to provide cutfree bunched hypersequent calculi for a large cl...

متن کامل

Simple Cut Elimination Proof for Hybrid Logic

In the paper we present a relatively simple proof of cut elimination theorem for variety of hybrid logics in the language with satisfaction operators and universal modality. The proof is based on the strategy introduced originally in the framework of hypersequent calculi but it works well also for standard sequent calculi. Sequent calculus examined in the paper works on so called satisfaction f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره cs.LO/0211021  شماره 

صفحات  -

تاریخ انتشار 2002